Key Based Random Permutation (KBRP)
نویسندگان
چکیده
منابع مشابه
Key Based Random Permutation (KBRP)
This study introduces a method for generating a particular permutation P of a given size N out of N! permutations from a given key. This method computes a unique permutation for a specific size since it takes the same key; therefore, the same permutation can be computed each time the same key and size are applied. The name of random permutation comes from the fact that the probability of gettin...
متن کاملA Password-Based Key Derivation Algorithm Using the KBRP Method
This study presents a new efficient password-based strong key derivation algorithm using the key based random permutation the KBRP method. The algorithm consists of five steps, the first three steps are similar to those formed the KBRP method. The last two steps are added to derive a key and to ensure that the derived key has all the characteristics of a strong key. In order to demonstrate the ...
متن کاملBlock Cipher Involving Key Based Random Interlacing and Key Based Random Decomposition
Problem statement: The strength of the block ciphers depend on the degree of confusion and diffusion induced in the cipher. Most of the transformations used for this purpose are well known to every one and can be broken by a crypt analyzer. Therefore, in order to counter attack the crypt analyzer, there is a need for better transformations in addition to the existing one. Approach: We tried to ...
متن کاملDES Enhancement Using Key-Based Randomized Initial Permutation
This paper introduces a new method to enhance the performance of the Standard Data Encryption Standard (DES), or any permutation dependent encryption algorithms, by increasing the brute-force attack time complexity by a factor of 64!. The new algorithm is referred to as Enhanced DES (EDES). This is done by replacing the predefined initial permutations (IP) and its inverse (IP) that are used in ...
متن کاملCryptanalysis of Boolean permutation-based key escrow scheme
Wu and Varadharajan [Computers and Electrical Engineering 25(4) 1999] proposed a fast public key escrow scheme. The security of this system is based on a special class of trapdoor Boolean permutations that can be constructed efficiently. In this paper, we show that this proposed class of Boolean permutations can be easily inverted without the knowledge of the secret key parameters. This allows ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2006
ISSN: 1549-3636
DOI: 10.3844/jcssp.2006.419.421